TSTP Solution File: SYN361^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN361^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 08:22:02 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYN361^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 13:46:22 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 % (17914)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.21/0.38 % (17921)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.21/0.38 % (17916)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.21/0.38 % (17914)First to succeed.
% 0.21/0.38 % (17921)Also succeeded, but the first one will report.
% 0.21/0.38 % (17915)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.21/0.38 % (17914)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% 0.21/0.38 thf(func_def_0, type, cS: $i > $o).
% 0.21/0.38 thf(func_def_1, type, cQ: $i > $i > $o).
% 0.21/0.38 thf(func_def_2, type, cP: $i > $i > $o).
% 0.21/0.38 thf(func_def_7, type, sK1: $i > $i).
% 0.21/0.38 thf(f21,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f20])).
% 0.21/0.38 thf(f20,plain,(
% 0.21/0.38 ($true != $true)),
% 0.21/0.38 inference(superposition,[],[f19,f16])).
% 0.21/0.38 thf(f16,plain,(
% 0.21/0.38 ( ! [X1 : $i] : (($true = (cP @ X1 @ sK0))) )),
% 0.21/0.38 inference(cnf_transformation,[],[f12])).
% 0.21/0.38 thf(f12,plain,(
% 0.21/0.38 ! [X1] : ($true = (cP @ X1 @ sK0)) & ! [X2] : ($true = (cS @ X2)) & ! [X3] : (($true = (cQ @ (sK1 @ X3) @ X3)) | ((cS @ X3) != $true)) & ! [X5,X6] : (((cP @ X6 @ X5) != $true) | ($true != (cQ @ X6 @ X5)))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f11,f10])).
% 0.21/0.38 thf(f10,plain,(
% 0.21/0.38 ? [X0] : ! [X1] : ((cP @ X1 @ X0) = $true) => ! [X1] : ($true = (cP @ X1 @ sK0))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f11,plain,(
% 0.21/0.38 ! [X3] : (? [X4] : ((cQ @ X4 @ X3) = $true) => ($true = (cQ @ (sK1 @ X3) @ X3)))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f9,plain,(
% 0.21/0.38 ? [X0] : ! [X1] : ((cP @ X1 @ X0) = $true) & ! [X2] : ($true = (cS @ X2)) & ! [X3] : (? [X4] : ((cQ @ X4 @ X3) = $true) | ((cS @ X3) != $true)) & ! [X5,X6] : (((cP @ X6 @ X5) != $true) | ($true != (cQ @ X6 @ X5)))),
% 0.21/0.38 inference(rectify,[],[f8])).
% 0.21/0.38 thf(f8,plain,(
% 0.21/0.38 ? [X4] : ! [X5] : ($true = (cP @ X5 @ X4)) & ! [X6] : ((cS @ X6) = $true) & ! [X2] : (? [X3] : ($true = (cQ @ X3 @ X2)) | ($true != (cS @ X2))) & ! [X0,X1] : (((cP @ X1 @ X0) != $true) | ($true != (cQ @ X1 @ X0)))),
% 0.21/0.38 inference(flattening,[],[f7])).
% 0.21/0.38 thf(f7,plain,(
% 0.21/0.38 ! [X6] : ((cS @ X6) = $true) & (! [X0,X1] : (((cP @ X1 @ X0) != $true) | ($true != (cQ @ X1 @ X0))) & ? [X4] : ! [X5] : ($true = (cP @ X5 @ X4)) & ! [X2] : (? [X3] : ($true = (cQ @ X3 @ X2)) | ($true != (cS @ X2))))),
% 0.21/0.38 inference(ennf_transformation,[],[f6])).
% 0.21/0.38 thf(f6,plain,(
% 0.21/0.38 ~((! [X0,X1] : (((cP @ X1 @ X0) = $true) => ($true != (cQ @ X1 @ X0))) & ? [X4] : ! [X5] : ($true = (cP @ X5 @ X4)) & ! [X2] : (($true = (cS @ X2)) => ? [X3] : ($true = (cQ @ X3 @ X2)))) => ? [X6] : ((cS @ X6) != $true))),
% 0.21/0.38 inference(flattening,[],[f5])).
% 0.21/0.38 thf(f5,plain,(
% 0.21/0.38 ~((! [X0,X1] : (((cP @ X1 @ X0) = $true) => ~($true = (cQ @ X1 @ X0))) & ! [X2] : (($true = (cS @ X2)) => ? [X3] : ($true = (cQ @ X3 @ X2))) & ? [X4] : ! [X5] : ($true = (cP @ X5 @ X4))) => ? [X6] : ~((cS @ X6) = $true))),
% 0.21/0.38 inference(fool_elimination,[],[f4])).
% 0.21/0.38 thf(f4,plain,(
% 0.21/0.38 ~((! [X0,X1] : ((cP @ X1 @ X0) => ~(cQ @ X1 @ X0)) & ! [X2] : ((cS @ X2) => ? [X3] : (cQ @ X3 @ X2)) & ? [X4] : ! [X5] : (cP @ X5 @ X4)) => ? [X6] : ~(cS @ X6))),
% 0.21/0.38 inference(rectify,[],[f2])).
% 0.21/0.38 thf(f2,negated_conjecture,(
% 0.21/0.38 ~((! [X2,X1] : ((cP @ X1 @ X2) => ~(cQ @ X1 @ X2)) & ! [X1] : ((cS @ X1) => ? [X2] : (cQ @ X2 @ X1)) & ? [X0] : ! [X1] : (cP @ X1 @ X0)) => ? [X3] : ~(cS @ X3))),
% 0.21/0.38 inference(negated_conjecture,[],[f1])).
% 0.21/0.38 thf(f1,conjecture,(
% 0.21/0.38 (! [X2,X1] : ((cP @ X1 @ X2) => ~(cQ @ X1 @ X2)) & ! [X1] : ((cS @ X1) => ? [X2] : (cQ @ X2 @ X1)) & ? [X0] : ! [X1] : (cP @ X1 @ X0)) => ? [X3] : ~(cS @ X3)),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2112)).
% 0.21/0.38 thf(f19,plain,(
% 0.21/0.38 ( ! [X0 : $i] : (($true != (cP @ (sK1 @ X0) @ X0))) )),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f18])).
% 0.21/0.38 thf(f18,plain,(
% 0.21/0.38 ( ! [X0 : $i] : (($true != (cP @ (sK1 @ X0) @ X0)) | ($true != $true)) )),
% 0.21/0.38 inference(superposition,[],[f13,f17])).
% 0.21/0.38 thf(f17,plain,(
% 0.21/0.38 ( ! [X3 : $i] : (($true = (cQ @ (sK1 @ X3) @ X3))) )),
% 0.21/0.38 inference(subsumption_resolution,[],[f14,f15])).
% 0.21/0.38 thf(f15,plain,(
% 0.21/0.38 ( ! [X2 : $i] : (($true = (cS @ X2))) )),
% 0.21/0.38 inference(cnf_transformation,[],[f12])).
% 0.21/0.38 thf(f14,plain,(
% 0.21/0.38 ( ! [X3 : $i] : (((cS @ X3) != $true) | ($true = (cQ @ (sK1 @ X3) @ X3))) )),
% 0.21/0.38 inference(cnf_transformation,[],[f12])).
% 0.21/0.38 thf(f13,plain,(
% 0.21/0.38 ( ! [X6 : $i,X5 : $i] : (($true != (cQ @ X6 @ X5)) | ((cP @ X6 @ X5) != $true)) )),
% 0.21/0.38 inference(cnf_transformation,[],[f12])).
% 0.21/0.38 % SZS output end Proof for theBenchmark
% 0.21/0.38 % (17914)------------------------------
% 0.21/0.38 % (17914)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (17914)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (17914)Memory used [KB]: 5500
% 0.21/0.38 % (17914)Time elapsed: 0.005 s
% 0.21/0.38 % (17914)Instructions burned: 2 (million)
% 0.21/0.38 % (17914)------------------------------
% 0.21/0.38 % (17914)------------------------------
% 0.21/0.38 % (17913)Success in time 0.018 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------